Eecient Ordering of State Variables and Transition Relation Partitions in Symbolic Model Checking
نویسنده
چکیده
Among the main algorithmic problems in the veriication of sequential circuits are the computation of good orders of state variables and transition relation partitions. Existing model checking packages like SMV from CMU, VIS from Berkeley or Rulebase from IBM Haifa provide variants of Rudell's sifting algorithm for the variable ordering problem and greedy-type algorithms for the partition ordering problem. For both problems, we give new simulated an-nealing based algorithms and we provide a model checking program called VERIFY which is based on SMV. The impact of our approach is demonstrated on industrial arbiter circuits and ISCAS '89 benchmarks. In particular on large industrial circuits our algorithms show a better space/time performance than previously given heuristics.
منابع مشابه
Eecient Ordering of State Variables and Transition Relation Partitions in Symbolic Model Checking Eecient Ordering of State Variables and Transition Relation Partitions in Symbolic Model Checking
Among the main algorithmic problems in the veriication of sequential circuits are the computation of good orders of state variables and transition relation partitions. Existing model checking packages like SMV from CMU, VIS from Berkeley or Rulebase from IBM Haifa provide variants of Rudell's sifting algorithm for the variable ordering problem and greedy-type algorithms for the partition orderi...
متن کاملEfficient Model Checking by Automated Ordering of Transition Relation Partitions
In symbolic model checking, the behavior of a model to be verified is captured by the transition relation of the state space implied by the model. Unfortunately, the size of the transition relation grows rapidly with the number of states even for small models, rendering them impossible to verify. A recent work [5] described a method for partitioning the transition relation, thus reducing the ov...
متن کاملSymbolic Model Checking with Isomorphism Exploiting Transition Relations
Symbolic model checking by using BDDs has greatly improved the applicability of model checking. Nevertheless, BDD based symbolic model checking can still be very memory and time consuming. One main reason is the complex transition relation of systems. Sometimes, it is even not possible to generate the transition relation, due to its exhaustive memory requirements. To diminish this problem, the ...
متن کاملSymbolic Equivalence Checking
We describe the implementation, within ALDEBARAN of an al-gorithmic method allowing the generation of a minimal labeled transition system from an abstract model ; this minimality is relative to an equivalence relation. The method relies on a symbolic representation of the state space. We compute the minimal labeled transition system using the Binary Decision Diagram structures to represent the ...
متن کاملOptimising Ordering Strategies for Symbolic Model Checking of Railway Interlockings
Interlockings implement Railway Signalling Principles which ensure the safe movements of trains along a track system. They are safety critical systems which require a thorough analysis. We are aiming at supporting the safety analysis by automated tools, namely model checkers. Model checking provides a full state space exploration and is thus intrinsically limited in the problem’s state space. C...
متن کامل